SHAPE RECOGNITION METHOD BASED ON THE k-NEAREST NEIGHBOR RULE
نویسنده
چکیده
In artificial intelligence, each shape is represented by the vector of the characteristic features and represents a point in the d-dimensional space of the descriptors. An unknown shape is rejected or is identified with one or more models (known shapes previously learned). The shape recognition is based on the similarity between the unknown shape and each model. The distance between the associated two vectors is used for estimate the similarity between any two shapes. The paper presents a recognition method based on the k-nearest neighbors rule. This method supposes two stages: model classification and shape identification. Only invariant descriptors are used for the model classification at many levels and this classification is realized only once, in the learning stage of the recognition process. The shape identification supposes the identification of the most similar class of models, the identification of the nearest neighbors and the identification of the most similar model. A shape is identified with a model if that shape is inside the region of the accepted tolerance of the model. The proposed method assures fast and simple shape recognition in robotics.
منابع مشابه
Identification of selected monogeneans using image processing, artificial neural network and K-nearest neighbor
Abstract Over the last two decades, improvements in developing computational tools made significant contributions to the classification of biological specimens` images to their correspondence species. These days, identification of biological species is much easier for taxonomist and even non-taxonomists due to the development of automated computer techniques and systems. In this study, we d...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملNeighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this work, we propose a new method for neighborhood size selection that is based on the concept of statistical confidence. We define the confidence associated with a decision that is made by the majority rule from a finite num...
متن کامل